#include <bits/stdc++.h>
using namespace std;
int n,minn=100000;
int a[100000],b[100000],v[100000],l[100000],r[100000];//v gong ji ci shu l tui chu ju
void dfs(int n)
{int c,i,j,step=0;
for(i=1;i<=n;i++)
{c=0;
    for(int w=1;w<=n;w++)
    for( j=1;j<=n;j++)
         if(l[j]==1&&v[w]==1&&a[j+1]>a[j]) {l[j]=0;v[j+1]=0;}
         for(int u=1;u<=n;u++)
        if(l[u]==1) c++;//fan zhe lai
        r[i]=c;
  }
 sort(r+1,r+n+1);
        for(int f=n;f>=1;f=f-1)
        if(r[f]!=0) minn=r[f];

}


int main()
{
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
   {
        scanf("%d",&a[i]);
        v[a[i]]=1;
        l[a[i]]=1;
   }
    sort(a+1,a+n+1);
 dfs(n);
printf("%d",minn);
return 0;
}
